- dependence graph
- граф зависимостей (в параллельной системе - ориентированный граф, узлы которого соответствуют вычислительным операциям, а дуги отображают зависимости между ними)
English-Russian dictionary of computer science and programming. 2013.
dependence graph
Смотреть что такое "dependence graph" в других словарях:
Control flow graph — Simplified control flowgraphs[1] A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… … Wikipedia
Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… … Wikipedia
Dependency graph — In mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other. It is possible to derive an evaluation order or the absence of an evaluation order… … Wikipedia
Static single assignment form — In compiler design, static single assignment form (often abbreviated as SSA form or SSA) is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are split into versions , new… … Wikipedia
Удаление мёртвого кода — В теории компиляторов удалением мёртвого кода (англ. dead code elimination, DCE) называется оптимизация, удаляющая мёртвый код. Мёртвым кодом (так же бесполезным кодом) называют код, исполнение которого не влияет на вывод программы, все… … Википедия
Dead code elimination — In compiler theory, dead code elimination is a compiler optimization to remove code which does not affect the program results. Removing such code has two benefits: it shrinks program size, an important consideration in some contexts, and it… … Wikipedia
CDG — Die Abkürzung CDG steht für: die frühere Carl Duisberg Gesellschaft e. V., seit 2001 InWEnt das Carl Duisberg Gymnasium in Wuppertal Oberbarmen den IATA Flughafencode des Flughafen Paris Charles de Gaulle in Frankreich den französischen… … Deutsch Wikipedia
Overpopulation — Graph of human population from 10,000 BC–2000 AD showing the unprecedented population growth since the 19th century Overpopulation is a condition where an organism s numbers exceed the carrying capacity of its habitat. The term often refers to… … Wikipedia
Economic Affairs — ▪ 2006 Introduction In 2005 rising U.S. deficits, tight monetary policies, and higher oil prices triggered by hurricane damage in the Gulf of Mexico were moderating influences on the world economy and on U.S. stock markets, but some other… … Universalium
